Latency Tolerance for Dynamic Proces - sors . CSL - TR - 96 - 687 , January 1996
نویسندگان
چکیده
Public reporting burden for this collection of information is estimated to average 1 hour per response, including the time for reviewing instructions, searching existing data sources, gathering and maintaining the data needed, and completing and reviewing the collection of information. Send comment regarding this burden estimates or any other aspect of this collection of information, including suggestions for reducing the burden, to Washington Headquarters Services, Directorate for Information Operations and Reports, 12.6 Je erson Davis Highway, Suite 1204, Arlington, VA 22202-4302, and to the O ce of Management and Budget, Paperwork Reduction Project (0704-0188), Washington, DC 20503.
منابع مشابه
EE - TR - 96 - 25 CAR - TR - 830 CLIS - TR - 96 - 02 CS - TR - 3643 May , 1996 A Conceptual Framework for Text Filtering
This report develops a conceptual framework for text ltering practice and research, and reviews present practice in the eld. Text ltering is an information seeking process in which documents are selected from a dynamic text stream to satisfy a relatively stable and speciic information need. A model of the information seeking process is introduced and specialized to deene information ltering. Th...
متن کاملDynamic Constraints and Object Migration
A “role set” is the set of classes in a class hierarchy where an object may reside simultaneously. A “migration pattern” is a sequence of role sets that an object can migrate through. We define a “migration inventory”, which is a set of migration patterns, as a dynamic integrity constraint on object migration. We consider three update languages: SL which has five operators, CSL+ which extends S...
متن کاملInteger Linear Programming versus Dynamic Programming for Optimal Integrated VLIW Code Generation
To our knowledge there is only one Integer Linear Program ming ILP formulation in the literature that fully integrates all steps of code generation i e instruction selection register allocation and in struction scheduling on the basic block level We give in this paper an improved version of this ILP formulation that also covers VLIW proces sors Moreover our ILP formulation does no longer requir...
متن کاملDeterministic silence and self stabilizing leader election algorithm on id based ring
We present in this paper a deterministic silence and self stabilizing leader election algorithm on unidirectional id based rings which have a bound on their id values The id values of proces sors in a ring whose size is N have to be inferior to N k The size of communication registers required by the algorithm is constant The algorithm stabilizes in k N time keywords self stabilization leader el...
متن کامل